TSTP Solution File: NUM688^1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : NUM688^1 : TPTP v8.1.2. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% Computer : n014.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sun May 5 08:41:52 EDT 2024
% Result : Theorem 0.14s 0.39s
% Output : Refutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 24
% Syntax : Number of formulae : 84 ( 18 unt; 16 typ; 0 def)
% Number of atoms : 521 ( 83 equ; 0 cnn)
% Maximal formula atoms : 3 ( 7 avg)
% Number of connectives : 143 ( 74 ~; 51 |; 0 &; 0 @)
% ( 2 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 22 ( 21 >; 1 *; 0 +; 0 <<)
% Number of symbols : 20 ( 17 usr; 8 con; 0-6 aty)
% Number of variables : 58 ( 0 ^ 52 !; 0 ?; 58 :)
% ( 6 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
nat: $tType ).
thf(type_def_6,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
nat: $tType ).
thf(func_def_1,type,
x: nat ).
thf(func_def_2,type,
y: nat ).
thf(func_def_3,type,
z: nat ).
thf(func_def_4,type,
u: nat ).
thf(func_def_5,type,
more: nat > nat > $o ).
thf(func_def_7,type,
pl: nat > nat > nat ).
thf(func_def_11,type,
kCOMB:
!>[X0: $tType,X1: $tType] : ( X0 > X1 > X0 ) ).
thf(func_def_12,type,
bCOMB:
!>[X0: $tType,X1: $tType,X2: $tType] : ( ( X1 > X2 ) > ( X0 > X1 ) > X0 > X2 ) ).
thf(func_def_13,type,
vAND: $o > $o > $o ).
thf(func_def_14,type,
vOR: $o > $o > $o ).
thf(func_def_15,type,
vIMP: $o > $o > $o ).
thf(func_def_16,type,
vNOT: $o > $o ).
thf(func_def_17,type,
vEQ:
!>[X0: $tType] : ( X0 > X0 > $o ) ).
thf(f120,plain,
$false,
inference(avatar_sat_refutation,[],[f75,f95,f97,f99,f113,f116,f119]) ).
thf(f119,plain,
~ spl0_1,
inference(avatar_contradiction_clause,[],[f118]) ).
thf(f118,plain,
( $false
| ~ spl0_1 ),
inference(subsumption_resolution,[],[f117,f36]) ).
thf(f36,plain,
vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),more,x),y) = $true,
inference(cnf_transformation,[],[f21]) ).
thf(f21,plain,
vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),more,x),y) = $true,
inference(fool_elimination,[],[f20]) ).
thf(f20,plain,
vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),more,x),y),
inference(rectify,[],[f1]) ).
thf(f1,axiom,
vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),more,x),y),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m) ).
thf(f117,plain,
( ( vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),more,x),y) != $true )
| ~ spl0_1 ),
inference(subsumption_resolution,[],[f108,f70]) ).
thf(f70,plain,
( ( vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),more,z),u) = $true )
| ~ spl0_1 ),
inference(avatar_component_clause,[],[f68]) ).
thf(f68,plain,
( spl0_1
<=> ( vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),more,z),u) = $true ) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_1])]) ).
thf(f108,plain,
( ( vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),more,z),u) != $true )
| ( vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),more,x),y) != $true ) ),
inference(trivial_inequality_removal,[],[f107]) ).
thf(f107,plain,
( ( $true != $true )
| ( vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),more,z),u) != $true )
| ( vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),more,x),y) != $true ) ),
inference(superposition,[],[f31,f35]) ).
thf(f35,plain,
! [X2: nat,X3: nat,X0: nat,X1: nat] :
( ( $true = vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),more,vAPP(nat,nat,vAPP(nat,sTfun(nat,nat),pl,X0),X2)),vAPP(nat,nat,vAPP(nat,sTfun(nat,nat),pl,X1),X3)) )
| ( $true != vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),more,X2),X3) )
| ( $true != vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),more,X0),X1) ) ),
inference(cnf_transformation,[],[f30]) ).
thf(f30,plain,
! [X0: nat,X1: nat,X2: nat,X3: nat] :
( ( $true = vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),more,vAPP(nat,nat,vAPP(nat,sTfun(nat,nat),pl,X0),X2)),vAPP(nat,nat,vAPP(nat,sTfun(nat,nat),pl,X1),X3)) )
| ( $true != vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),more,X2),X3) )
| ( $true != vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),more,X0),X1) ) ),
inference(flattening,[],[f29]) ).
thf(f29,plain,
! [X0: nat,X1: nat,X2: nat,X3: nat] :
( ( $true = vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),more,vAPP(nat,nat,vAPP(nat,sTfun(nat,nat),pl,X0),X2)),vAPP(nat,nat,vAPP(nat,sTfun(nat,nat),pl,X1),X3)) )
| ( $true != vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),more,X2),X3) )
| ( $true != vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),more,X0),X1) ) ),
inference(ennf_transformation,[],[f19]) ).
thf(f19,plain,
! [X0: nat,X1: nat,X2: nat,X3: nat] :
( ( $true = vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),more,X0),X1) )
=> ( ( $true = vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),more,X2),X3) )
=> ( $true = vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),more,vAPP(nat,nat,vAPP(nat,sTfun(nat,nat),pl,X0),X2)),vAPP(nat,nat,vAPP(nat,sTfun(nat,nat),pl,X1),X3)) ) ) ),
inference(fool_elimination,[],[f18]) ).
thf(f18,plain,
! [X0: nat,X1: nat,X2: nat,X3: nat] :
( vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),more,X0),X1)
=> ( vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),more,X2),X3)
=> vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),more,vAPP(nat,nat,vAPP(nat,sTfun(nat,nat),pl,X0),X2)),vAPP(nat,nat,vAPP(nat,sTfun(nat,nat),pl,X1),X3)) ) ),
inference(rectify,[],[f5]) ).
thf(f5,axiom,
! [X1: nat,X2: nat,X3: nat,X4: nat] :
( vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),more,X1),X2)
=> ( vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),more,X3),X4)
=> vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),more,vAPP(nat,nat,vAPP(nat,sTfun(nat,nat),pl,X1),X3)),vAPP(nat,nat,vAPP(nat,sTfun(nat,nat),pl,X2),X4)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz21) ).
thf(f31,plain,
vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),more,vAPP(nat,nat,vAPP(nat,sTfun(nat,nat),pl,x),z)),vAPP(nat,nat,vAPP(nat,sTfun(nat,nat),pl,y),u)) != $true,
inference(cnf_transformation,[],[f22]) ).
thf(f22,plain,
vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),more,vAPP(nat,nat,vAPP(nat,sTfun(nat,nat),pl,x),z)),vAPP(nat,nat,vAPP(nat,sTfun(nat,nat),pl,y),u)) != $true,
inference(flattening,[],[f11]) ).
thf(f11,plain,
vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),more,vAPP(nat,nat,vAPP(nat,sTfun(nat,nat),pl,x),z)),vAPP(nat,nat,vAPP(nat,sTfun(nat,nat),pl,y),u)) != $true,
inference(fool_elimination,[],[f10]) ).
thf(f10,plain,
~ vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),more,vAPP(nat,nat,vAPP(nat,sTfun(nat,nat),pl,x),z)),vAPP(nat,nat,vAPP(nat,sTfun(nat,nat),pl,y),u)),
inference(rectify,[],[f7]) ).
thf(f7,negated_conjecture,
~ vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),more,vAPP(nat,nat,vAPP(nat,sTfun(nat,nat),pl,x),z)),vAPP(nat,nat,vAPP(nat,sTfun(nat,nat),pl,y),u)),
inference(negated_conjecture,[],[f6]) ).
thf(f6,conjecture,
vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),more,vAPP(nat,nat,vAPP(nat,sTfun(nat,nat),pl,x),z)),vAPP(nat,nat,vAPP(nat,sTfun(nat,nat),pl,y),u)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz22b) ).
thf(f116,plain,
~ spl0_1,
inference(avatar_contradiction_clause,[],[f115]) ).
thf(f115,plain,
( $false
| ~ spl0_1 ),
inference(subsumption_resolution,[],[f114,f36]) ).
thf(f114,plain,
( ( vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),more,x),y) != $true )
| ~ spl0_1 ),
inference(subsumption_resolution,[],[f109,f70]) ).
thf(f109,plain,
( ( vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),more,z),u) != $true )
| ( vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),more,x),y) != $true ) ),
inference(trivial_inequality_removal,[],[f106]) ).
thf(f106,plain,
( ( $true = $false )
| ( vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),more,z),u) != $true )
| ( vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),more,x),y) != $true ) ),
inference(superposition,[],[f101,f35]) ).
thf(f101,plain,
vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),more,vAPP(nat,nat,vAPP(nat,sTfun(nat,nat),pl,x),z)),vAPP(nat,nat,vAPP(nat,sTfun(nat,nat),pl,y),u)) = $false,
inference(trivial_inequality_removal,[],[f100]) ).
thf(f100,plain,
( ( $true != $true )
| ( vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),more,vAPP(nat,nat,vAPP(nat,sTfun(nat,nat),pl,x),z)),vAPP(nat,nat,vAPP(nat,sTfun(nat,nat),pl,y),u)) = $false ) ),
inference(superposition,[],[f31,f9]) ).
thf(f9,plain,
! [X0: $o] :
( ( $true = X0 )
| ( $false = X0 ) ),
introduced(fool_axiom,[]) ).
thf(f113,plain,
~ spl0_1,
inference(avatar_contradiction_clause,[],[f112]) ).
thf(f112,plain,
( $false
| ~ spl0_1 ),
inference(subsumption_resolution,[],[f111,f36]) ).
thf(f111,plain,
( ( vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),more,x),y) != $true )
| ~ spl0_1 ),
inference(subsumption_resolution,[],[f110,f70]) ).
thf(f110,plain,
( ( vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),more,z),u) != $true )
| ( vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),more,x),y) != $true ) ),
inference(trivial_inequality_removal,[],[f105]) ).
thf(f105,plain,
( ( $true = $false )
| ( vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),more,z),u) != $true )
| ( vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),more,x),y) != $true ) ),
inference(superposition,[],[f35,f101]) ).
thf(f99,plain,
~ spl0_2,
inference(avatar_contradiction_clause,[],[f98]) ).
thf(f98,plain,
( $false
| ~ spl0_2 ),
inference(subsumption_resolution,[],[f91,f36]) ).
thf(f91,plain,
( ( vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),more,x),y) != $true )
| ~ spl0_2 ),
inference(trivial_inequality_removal,[],[f90]) ).
thf(f90,plain,
( ( $true != $true )
| ( vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),more,x),y) != $true )
| ~ spl0_2 ),
inference(superposition,[],[f82,f38]) ).
thf(f38,plain,
! [X2: nat,X3: nat,X1: nat] :
( ( $true = vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),more,vAPP(nat,nat,vAPP(nat,sTfun(nat,nat),pl,X2),X1)),vAPP(nat,nat,vAPP(nat,sTfun(nat,nat),pl,X3),X1)) )
| ( $true != vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),more,X2),X3) ) ),
inference(equality_resolution,[],[f34]) ).
thf(f34,plain,
! [X2: nat,X3: nat,X0: nat,X1: nat] :
( ( $true = vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),more,vAPP(nat,nat,vAPP(nat,sTfun(nat,nat),pl,X2),X0)),vAPP(nat,nat,vAPP(nat,sTfun(nat,nat),pl,X3),X1)) )
| ( $true != vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),more,X2),X3) )
| ( X0 != X1 ) ),
inference(cnf_transformation,[],[f28]) ).
thf(f28,plain,
! [X0: nat,X1: nat,X2: nat,X3: nat] :
( ( $true = vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),more,vAPP(nat,nat,vAPP(nat,sTfun(nat,nat),pl,X2),X0)),vAPP(nat,nat,vAPP(nat,sTfun(nat,nat),pl,X3),X1)) )
| ( $true != vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),more,X2),X3) )
| ( X0 != X1 ) ),
inference(flattening,[],[f27]) ).
thf(f27,plain,
! [X0: nat,X1: nat,X2: nat,X3: nat] :
( ( $true = vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),more,vAPP(nat,nat,vAPP(nat,sTfun(nat,nat),pl,X2),X0)),vAPP(nat,nat,vAPP(nat,sTfun(nat,nat),pl,X3),X1)) )
| ( $true != vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),more,X2),X3) )
| ( X0 != X1 ) ),
inference(ennf_transformation,[],[f17]) ).
thf(f17,plain,
! [X0: nat,X1: nat,X2: nat,X3: nat] :
( ( X0 = X1 )
=> ( ( $true = vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),more,X2),X3) )
=> ( $true = vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),more,vAPP(nat,nat,vAPP(nat,sTfun(nat,nat),pl,X2),X0)),vAPP(nat,nat,vAPP(nat,sTfun(nat,nat),pl,X3),X1)) ) ) ),
inference(fool_elimination,[],[f16]) ).
thf(f16,plain,
! [X0: nat,X1: nat,X2: nat,X3: nat] :
( ( X0 = X1 )
=> ( vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),more,X2),X3)
=> vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),more,vAPP(nat,nat,vAPP(nat,sTfun(nat,nat),pl,X2),X0)),vAPP(nat,nat,vAPP(nat,sTfun(nat,nat),pl,X3),X1)) ) ),
inference(rectify,[],[f4]) ).
thf(f4,axiom,
! [X1: nat,X2: nat,X3: nat,X4: nat] :
( ( X1 = X2 )
=> ( vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),more,X3),X4)
=> vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),more,vAPP(nat,nat,vAPP(nat,sTfun(nat,nat),pl,X3),X1)),vAPP(nat,nat,vAPP(nat,sTfun(nat,nat),pl,X4),X2)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz19h) ).
thf(f82,plain,
( ( $true != vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),more,vAPP(nat,nat,vAPP(nat,sTfun(nat,nat),pl,x),z)),vAPP(nat,nat,vAPP(nat,sTfun(nat,nat),pl,y),z)) )
| ~ spl0_2 ),
inference(forward_demodulation,[],[f31,f74]) ).
thf(f74,plain,
( ( z = u )
| ~ spl0_2 ),
inference(avatar_component_clause,[],[f72]) ).
thf(f72,plain,
( spl0_2
<=> ( z = u ) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_2])]) ).
thf(f97,plain,
~ spl0_2,
inference(avatar_contradiction_clause,[],[f96]) ).
thf(f96,plain,
( $false
| ~ spl0_2 ),
inference(subsumption_resolution,[],[f92,f36]) ).
thf(f92,plain,
( ( vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),more,x),y) != $true )
| ~ spl0_2 ),
inference(trivial_inequality_removal,[],[f89]) ).
thf(f89,plain,
( ( $true = $false )
| ( vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),more,x),y) != $true )
| ~ spl0_2 ),
inference(superposition,[],[f84,f38]) ).
thf(f84,plain,
( ( $false = vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),more,vAPP(nat,nat,vAPP(nat,sTfun(nat,nat),pl,x),z)),vAPP(nat,nat,vAPP(nat,sTfun(nat,nat),pl,y),z)) )
| ~ spl0_2 ),
inference(trivial_inequality_removal,[],[f83]) ).
thf(f83,plain,
( ( $true != $true )
| ( $false = vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),more,vAPP(nat,nat,vAPP(nat,sTfun(nat,nat),pl,x),z)),vAPP(nat,nat,vAPP(nat,sTfun(nat,nat),pl,y),z)) )
| ~ spl0_2 ),
inference(superposition,[],[f82,f9]) ).
thf(f95,plain,
~ spl0_2,
inference(avatar_contradiction_clause,[],[f94]) ).
thf(f94,plain,
( $false
| ~ spl0_2 ),
inference(subsumption_resolution,[],[f93,f36]) ).
thf(f93,plain,
( ( vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),more,x),y) != $true )
| ~ spl0_2 ),
inference(trivial_inequality_removal,[],[f88]) ).
thf(f88,plain,
( ( $true = $false )
| ( vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),more,x),y) != $true )
| ~ spl0_2 ),
inference(superposition,[],[f38,f84]) ).
thf(f75,plain,
( spl0_1
| spl0_2 ),
inference(avatar_split_clause,[],[f32,f72,f68]) ).
thf(f32,plain,
( ( z = u )
| ( vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),more,z),u) = $true ) ),
inference(cnf_transformation,[],[f25]) ).
thf(f25,plain,
( ( z = u )
| ( vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),more,z),u) = $true ) ),
inference(ennf_transformation,[],[f23]) ).
thf(f23,plain,
( ( vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),more,z),u) != $true )
=> ( z = u ) ),
inference(flattening,[],[f13]) ).
thf(f13,plain,
( ( vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),more,z),u) != $true )
=> ( z = u ) ),
inference(fool_elimination,[],[f12]) ).
thf(f12,plain,
( ~ vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),more,z),u)
=> ( z = u ) ),
inference(rectify,[],[f2]) ).
thf(f2,axiom,
( ~ vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),more,z),u)
=> ( z = u ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',n) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : NUM688^1 : TPTP v8.1.2. Released v3.7.0.
% 0.08/0.15 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.14/0.36 % Computer : n014.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Fri May 3 14:11:08 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.14/0.37 % (1012)Running in auto input_syntax mode. Trying TPTP
% 0.14/0.38 % (1015)WARNING: value z3 for option sas not known
% 0.14/0.38 % (1014)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.14/0.38 % (1015)dis+2_11_add=large:afr=on:amm=off:bd=off:bce=on:fsd=off:fde=none:gs=on:gsaa=full_model:gsem=off:irw=on:msp=off:nm=4:nwc=1.3:sas=z3:sims=off:sac=on:sp=reverse_arity_569 on theBenchmark for (569ds/0Mi)
% 0.14/0.38 % (1018)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.14/0.38 % (1019)ott+10_10:1_add=off:afr=on:amm=off:anc=all:bd=off:bs=on:fsr=off:irw=on:lma=on:msp=off:nm=4:nwc=4.0:sac=on:sp=reverse_frequency_531 on theBenchmark for (531ds/0Mi)
% 0.14/0.38 % (1021)ott-10_8_av=off:bd=preordered:bs=on:fsd=off:fsr=off:fde=unused:irw=on:lcm=predicate:lma=on:nm=4:nwc=1.7:sp=frequency_522 on theBenchmark for (522ds/0Mi)
% 0.14/0.38 % (1013)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.14/0.38 % (1025)ott+1_64_av=off:bd=off:bce=on:fsd=off:fde=unused:gsp=on:irw=on:lcm=predicate:lma=on:nm=2:nwc=1.1:sims=off:urr=on_497 on theBenchmark for (497ds/0Mi)
% 0.14/0.38 % Exception at run slice level
% 0.14/0.38 User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.14/0.38 % Exception at run slice level
% 0.14/0.38 User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.14/0.38 % (1025)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 0.14/0.38 % Exception at run slice level
% 0.14/0.38 User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.14/0.39 % (1015)First to succeed.
% 0.14/0.39 % (1025)Also succeeded, but the first one will report.
% 0.14/0.39 % (1015)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-1012"
% 0.14/0.39 % (1015)Refutation found. Thanks to Tanya!
% 0.14/0.39 % SZS status Theorem for theBenchmark
% 0.14/0.39 % SZS output start Proof for theBenchmark
% See solution above
% 0.14/0.39 % (1015)------------------------------
% 0.14/0.39 % (1015)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.14/0.39 % (1015)Termination reason: Refutation
% 0.14/0.39
% 0.14/0.39 % (1015)Memory used [KB]: 787
% 0.14/0.39 % (1015)Time elapsed: 0.009 s
% 0.14/0.39 % (1015)Instructions burned: 10 (million)
% 0.14/0.39 % (1012)Success in time 0.024 s
%------------------------------------------------------------------------------